HR - Automatic Concept Formation in Finite Algebras

نویسنده

  • Simon Colton
چکیده

We are investigating how and why mathematicians invent new concepts while developing a theory, and implementing our ideas into the HR system, which automatically produces, assesses and displays concepts in finite algebras, such as finite group theory. We fit’st determined a reason for HI~ to produce concepts to classify a given set of groups up to isomorphism. Doing so would involve inventing concepts which help describe groups, so a classification can occur, and inventing concepts which help generate new examples of groups, so that improvements to the classification are necessitated, perpetuating the process. Next, we developed measures to tell us how interesting the concepts produced were (see Colton 1997). This helped us determine the kinds of concepts HR. should produce and with this in mind, we implemented production rules taking one (or two) concepts as input and outputting a new concept.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

HR - A System for Machine Discovery in Finite Algebras

We describe the HR concept formation program which invents mathematical definitions and conjectures in finite algebras such as group theory and ring theory. We give the methods behind and the reasons for the concept formation in HR, an evaluation of its performance in its training domain, group theory, and a look at HR in domains other than group theory.

متن کامل

Automatic Concept Formation in Pure Mathematics

The HR program forms concepts and makes conjectures in domains of pure mathematics and uses theorem prover OTTER and model generator MACE to prove or disprove the conjectures. HR measures properties of concepts and assesses the theorems and proofs involving them to estimate the interestingness of each concept and employ a best first search. This approach has led HR to the discovery of interesti...

متن کامل

Automatic Concept Formation in Pure

The HR program forms concepts and makes conjectures in domains of pure mathematics and uses theorem prover OTTER and model generator MACE to prove or disprove the conjectures. HR measures properties of concepts and assesses the theorems and proofs involving them to estimate the interestingness of each concept and employ a best rst search. This approach has led HR to the discovery of interesting...

متن کامل

Automatic continuity of almost multiplicative maps between Frechet algebras

For Fr$acute{mathbf{text{e}}}$chet algebras $(A, (p_n))$ and $(B, (q_n))$, a linear map $T:Arightarrow B$ is textit{almost multiplicative} with respect to $(p_n)$ and $(q_n)$, if there exists $varepsilongeq 0$ such that $q_n(Tab - Ta Tb)leq varepsilon p_n(a) p_n(b),$ for all $n in mathbb{N}$, $a, b in A$, and it is called textit{weakly almost multiplicative} with respect to $(p_n)$ and $(q_n)$...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998